The Typical Approximate Structure of Sets with Bounded Sumset

Let and be randomly chosen subsets of the first positive integers cardinalities , such that their sumset has size . We show asymptotically almost surely are fully contained in arithmetic progressions with same common difference approximately also prove a counting theorem for pairs sets arbitrary abelian groups. The results hold Our main tool is an asymmetric version method hypergraph containers which was recently used by Campos to similar special case